Potentials of a Markov process are expected suprema

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Chain Rule for the Expected Suprema of Gaussian Processes

The expected supremum of a Gaussian process indexed by the image of an index set under a function class is bounded in terms of separate properties of the index set and the function class. The bound is relevant to the estimation of nonlinear transformations or the analysis of learning algorithms whenever hypotheses are chosen from composite classes, as is the case for multi-layer models.

متن کامل

Expected Duration of Dynamic Markov PERT Networks

Abstract : In this paper , we apply the stochastic dynamic programming to approximate the mean project completion time in dynamic Markov PERT networks. It is assumed that the activity durations are independent random variables with exponential distributions, but some social and economical problems influence the mean of activity durations. It is also assumed that the social problems evolve in ac...

متن کامل

V.N. Sudakov’s Work on Expected Suprema of Gaussian Processes

It is noted that the late Volodya N. Sudakov (1934–2016) first published a statement in 1973 and proof in 1976 that the expected supremum of a centered Gaussian process is bounded above by a constant times a metric entropy integral. In particular, the present author (R.M. Dudley) defined such an integral but did not state nor prove such a bound.

متن کامل

Queueing approximation of suprema of spectrally positive Lévy process

Let W = sup0≤t<∞(X(t)− βt), where X is a spectrally positive Lévy process with expectation zero and 0 < β < ∞. One of the main results of the paper says that for such a process X there exists a sequence of M/GI/1 queues for which stationary waiting times converge in distribution to W. The second result shows that condition (III) of Proposition 2 in the paper is not implied by all other conditio...

متن کامل

Constructive Suprema

Partially ordered sets are investigated from the point of view of Bishop’s constructive mathematics, which can be viewed as the constructive core of mathematics and whose theorems can be translated into many formal systems of computable mathematics. The relationship between two classically equivalent notions of supremum is examined in detail. Whereas the classical least upper bound is based on ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ESAIM: Probability and Statistics

سال: 2007

ISSN: 1292-8100,1262-3318

DOI: 10.1051/ps:2007008